A switch scheduling algorithm for periodic messages using laxity decomposition method

نویسندگان

  • Jaehong Shim
  • Kyongok Yun
  • Kyunghee Choi
  • Gihyun Jung
  • Seungkyu Park
  • Dugkyoo Choi
چکیده

Scheduling Algorithm for Programmable Logic Controllers with Remote I/O's p. 87 Concurrency Control for Real-Time Database Systems with Mixed Transactions p. 96 Scheduling Real-Time Read-Only Transactions p. 104 An Index Recovery Method for Real-Time DBMS in Client-Server Architecture p. 110 An Implementation and Performance Analysis of Backup System Using Concurrent Log Processing in Real-Time DBMS p. 118

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Least-Laxity-First Scheduling Algorithm of Variable Time Slice for Periodic Tasks

The LLF (Least Laxity First) scheduling algorithm assigns a priority to a task according to its executing urgency. The smaller the laxity value of a task is, the sooner it needs to be executed. When two or more tasks have same or approximate laxity values, LLF scheduling algorithm leads to frequent switches among tasks, causes extra overhead in a system, and therefore, restricts its application...

متن کامل

A Scheduling Algorithm of Periodic Messages for Hard Real-time Communications on a Switched Ethernet

Switched Ethernet has been considered as a promising network technology for real-time communications required by process control, factory automation and other real-time applications. The switched Ethernet has many features for real-time communications such as providing a large amount of bandwidth, micro-segmentation of traffic, and full-duplex links, but to provide the hard real-time communicat...

متن کامل

A Modified Least-Laxity-First Scheduling Algorithm for Real-Time Tasks

The Least-Laxity-First(LLF) scheduling algorithm assigns higher priority to a task with the least laxity, and has been proved to be optimal for a uniprocessor systems. The algorithm, however, is impractical to implement because laxity tie results in the frequent context switches among the tasks. The Modified Least-Laxity-First (MLLF) scheduling algorithm proposed in this paper solves the proble...

متن کامل

EDF-Based Real-Time Message Scheduling of Periodic Messages on a Master-Slave-Based Synchronized Switched Ethernet

Switched Ethernet has many features for real-time communications but cannot guarantee the timely delivery of a real-time message due to possible collisions on the output ports. This paper first suggests a feasible condition for real-time communication of periodic messages on a master-slave-based synchronized switched Ethernet. Then an EDF (Earliest Deadline First)-based scheduling algorithm tha...

متن کامل

Benders’ decomposition algorithm to solve bi-level bi-objective scheduling of aircrafts and gate assignment under uncertainty

Management and scheduling of flights and assignment of gates to aircraft play a significant role to improve the performance of the airport, due to the growing number of flights and decreasing the flight times. This research addresses the assignement and scheduling problem of runways and gates simultaneously. Moreover, this research is the first study that considers the constraint of unavailabil...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997